Semi-Partitioning Technique for Multiprocessor Real-Time Scheduling
نویسندگان
چکیده
A semi-partitioning technique is presented for efficient scheduling of sporadic task systems on multiprocessors. The presented technique performs in the same manner as the traditional partitioning, as long as tasks are successfully partitioned, but a task is allowed to be shared among multiple processors for its execution, if a spare capacity of every individual processor is not enough to accept the full execution of the task, beyond partitioning. We also design an EDF-based algorithm in which the semi-partitioning technique is combined. According to the simulation results, the presented semi-partitioning approach improves schedulable multiprocessor utilization by 10 to 30%, over the traditional partitioning approach.
منابع مشابه
A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملPFGN: A Hybrid Multiprocessor Real-Time Scheduling Algorithm for Data Stream Management Systems
In many of recent applications data are received as infinite, continuous, rapid and time varying data streams. Real-time processing of queries over such streams is essential in most of the applications. Single processor systems are not capable to provide the desired speed to be real-time. Parallelism over multiprocessors can be used to handle this deficit. In such a system, a multiprocessor rea...
متن کاملComparison of global and partitioning schemes for scheduling rate monotonic tasks on a multiprocessor
In this paper we study GRMS, a global scheduling scheme for rate monotonic tasks on a multiprocessor. Several admission control algorithms for GRMS are presented, both for hard and soft real-time tasks. The average performance of these admission control algorithms is compared with the performance of known partitioning schemes. The result of these comparisons outlines some situations where one s...
متن کاملHybrid Multiprocessor Real-Time Scheduling Approach
Real-time scheduling is one of the most important aspects of a real-time system design. To achieve a real-time system’s requirement, especially to be fast, multiprocessor systems are used. Generally, multiprocessor real-time scheduling algorithms fall into one the two well-known approaches: Partitioning or Global. The partitioning approach has acceptable overhead for underlying system but can N...
متن کاملFault-Tolerant Deadline-Monotonic Algorithm for Scheduling Hard-Real-Time Tasks
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a multiprocessor system. Fault-tolerance is achieved by using a combined duplication technique where each task scheduled on a processor has either an active or a passive copy scheduled on a different processor. Simulatio...
متن کامل